An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
This paper presents a constraint logic programming model for the trav-eling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive assumption on the time windows. Unlike dynamic programming approaches whose performance relies heavily on the degree of discretization applied to the data, our algorithm does not suuer from such space...
متن کاملan effective ant colony algorithm for the traveling salesman problem
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملTime Dependent Traveling Salesman Problem with Time Windows: Properties and an Exact Algorithm
In this paper, we deal with the Time-Dependent Traveling Salesman Problem with Time Windows (TDTSPTW ). Firstly, we prove that under special conditions the TDTSPTW can be solved as an Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW ), with suitable-defined time windows and (constant) travel times. Secondly, we show that, if the special conditions do not hold, the ATSPTW optimal ...
متن کاملTime-Dependent Traveling Salesman Problem with Multiple Time Windows
The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows. Moreover, since the assumption of constant travel time between two locatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1995
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.43.2.367